An Efficient Branch-and-Bound Algorithm for Interface-Based Modular Product Design and Performance Evaluation
Identifieur interne : 000449 ( Main/Exploration ); précédent : 000448; suivant : 000450An Efficient Branch-and-Bound Algorithm for Interface-Based Modular Product Design and Performance Evaluation
Auteurs : John Jung-Woon Yoo [États-Unis] ; Anirudh Aryasomayajula [États-Unis] ; SEUNG KI MOON [Singapour]Source :
- Journal of computing and information science in engineering [ 1530-9827 ] ; 2013.
Descripteurs français
- Pascal (Inist)
- Conception ingénierie, Ingénierie simultanée, Mémoire entreprise, Conception assistée, Composant logiciel, Fourniture information, Information technique, Planification, Système information, Architecture système, Mondialisation, Conception modulaire, Evaluation performance, Lisibilité, Langage intermédiaire, Méthode énumération implicite, Système modulaire, Algorithmique, Problème NP difficile, Recherche profondeur d'abord, Algorithme recherche, Etude cas, Assurance qualité, Etude expérimentale, ..
- Wicri :
- topic : Mondialisation.
English descriptors
- KwdEn :
- Algorithmics, Case study, Computer aided design, Concurrent engineering, Engineering design, Experimental study, Factory memory, First depth search, Globalization, Implicit enumeration method, Information delivery, Information system, Intermediate language, Legibility, Modular design, Modular system, NP hard problem, Performance evaluation, Planning, Quality assurance, Search algorithm, Software component, System architecture, Technical information.
Abstract
In our earlier work, we have proposed a cyberinfrastructure-based collaboration system for modular product design. One of the main components of the system is a design repository to which suppliers can upload the descriptions of their components using machine-readable, interface-based component description language, so that manufacturers can refer to the descriptions during product design phases. In this paper, we propose an efficient algorithmic approach based on a branch-and-bound (BnB) algorithm to support product design using the interface-based component descriptions stored in the design repository. This product design problem is categorized into a planning problem, whose complexity is known as non-deterministic polynomial-time (NP) hard. For performance evaluation, we compare the performance of the branch-and-bound algorithm with that of a depth-first search (DFS) algorithm, which is an exhaustive search method. This paper describes the details of the proposed branch-and-bound algorithm using a case study and experimental results are discussed.
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000005
- to stream PascalFrancis, to step Curation: 000232
- to stream PascalFrancis, to step Checkpoint: 000013
- to stream Main, to step Merge: 000450
- to stream Main, to step Curation: 000449
Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">An Efficient Branch-and-Bound Algorithm for Interface-Based Modular Product Design and Performance Evaluation</title><author><name sortKey="Yoo, John Jung Woon" sort="Yoo, John Jung Woon" uniqKey="Yoo J" first="John Jung-Woon" last="Yoo">John Jung-Woon Yoo</name><affiliation wicri:level="2"><inist:fA14 i1="01"><s1>Department of Industrial and Manufacturing Engineering and Technology, Bradley University</s1><s2>Peoria, IL 61625</s2><s3>USA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>États-Unis</country><placeName><region type="state">Illinois</region></placeName></affiliation></author><author><name sortKey="Aryasomayajula, Anirudh" sort="Aryasomayajula, Anirudh" uniqKey="Aryasomayajula A" first="Anirudh" last="Aryasomayajula">Anirudh Aryasomayajula</name><affiliation wicri:level="2"><inist:fA14 i1="01"><s1>Department of Industrial and Manufacturing Engineering and Technology, Bradley University</s1><s2>Peoria, IL 61625</s2><s3>USA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>États-Unis</country><placeName><region type="state">Illinois</region></placeName></affiliation></author><author><name sortKey="Seung Ki Moon" sort="Seung Ki Moon" uniqKey="Seung Ki Moon" last="Seung Ki Moon">SEUNG KI MOON</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>School of Mechanical and Aerospace Engineering, Nanyang Technological University, 50 Nanyang Avenue, N3.2, 01-29</s1><s2>Singapore 639798</s2><s3>SGP</s3><sZ>3 aut.</sZ></inist:fA14><country>Singapour</country><wicri:noRegion>Singapore 639798</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">14-0082576</idno><date when="2013">2013</date><idno type="stanalyst">PASCAL 14-0082576 INIST</idno><idno type="RBID">Pascal:14-0082576</idno><idno type="wicri:Area/PascalFrancis/Corpus">000005</idno><idno type="wicri:Area/PascalFrancis/Curation">000232</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000013</idno><idno type="wicri:doubleKey">1530-9827:2013:Yoo J:an:efficient:branch</idno><idno type="wicri:Area/Main/Merge">000450</idno><idno type="wicri:Area/Main/Curation">000449</idno><idno type="wicri:Area/Main/Exploration">000449</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">An Efficient Branch-and-Bound Algorithm for Interface-Based Modular Product Design and Performance Evaluation</title><author><name sortKey="Yoo, John Jung Woon" sort="Yoo, John Jung Woon" uniqKey="Yoo J" first="John Jung-Woon" last="Yoo">John Jung-Woon Yoo</name><affiliation wicri:level="2"><inist:fA14 i1="01"><s1>Department of Industrial and Manufacturing Engineering and Technology, Bradley University</s1><s2>Peoria, IL 61625</s2><s3>USA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>États-Unis</country><placeName><region type="state">Illinois</region></placeName></affiliation></author><author><name sortKey="Aryasomayajula, Anirudh" sort="Aryasomayajula, Anirudh" uniqKey="Aryasomayajula A" first="Anirudh" last="Aryasomayajula">Anirudh Aryasomayajula</name><affiliation wicri:level="2"><inist:fA14 i1="01"><s1>Department of Industrial and Manufacturing Engineering and Technology, Bradley University</s1><s2>Peoria, IL 61625</s2><s3>USA</s3><sZ>1 aut.</sZ><sZ>2 aut.</sZ></inist:fA14><country>États-Unis</country><placeName><region type="state">Illinois</region></placeName></affiliation></author><author><name sortKey="Seung Ki Moon" sort="Seung Ki Moon" uniqKey="Seung Ki Moon" last="Seung Ki Moon">SEUNG KI MOON</name><affiliation wicri:level="1"><inist:fA14 i1="02"><s1>School of Mechanical and Aerospace Engineering, Nanyang Technological University, 50 Nanyang Avenue, N3.2, 01-29</s1><s2>Singapore 639798</s2><s3>SGP</s3><sZ>3 aut.</sZ></inist:fA14><country>Singapour</country><wicri:noRegion>Singapore 639798</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">Journal of computing and information science in engineering</title><title level="j" type="abbreviated">J. comput. inf. sci. eng.</title><idno type="ISSN">1530-9827</idno><imprint><date when="2013">2013</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">Journal of computing and information science in engineering</title><title level="j" type="abbreviated">J. comput. inf. sci. eng.</title><idno type="ISSN">1530-9827</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithmics</term><term>Case study</term><term>Computer aided design</term><term>Concurrent engineering</term><term>Engineering design</term><term>Experimental study</term><term>Factory memory</term><term>First depth search</term><term>Globalization</term><term>Implicit enumeration method</term><term>Information delivery</term><term>Information system</term><term>Intermediate language</term><term>Legibility</term><term>Modular design</term><term>Modular system</term><term>NP hard problem</term><term>Performance evaluation</term><term>Planning</term><term>Quality assurance</term><term>Search algorithm</term><term>Software component</term><term>System architecture</term><term>Technical information</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Conception ingénierie</term><term>Ingénierie simultanée</term><term>Mémoire entreprise</term><term>Conception assistée</term><term>Composant logiciel</term><term>Fourniture information</term><term>Information technique</term><term>Planification</term><term>Système information</term><term>Architecture système</term><term>Mondialisation</term><term>Conception modulaire</term><term>Evaluation performance</term><term>Lisibilité</term><term>Langage intermédiaire</term><term>Méthode énumération implicite</term><term>Système modulaire</term><term>Algorithmique</term><term>Problème NP difficile</term><term>Recherche profondeur d'abord</term><term>Algorithme recherche</term><term>Etude cas</term><term>Assurance qualité</term><term>Etude expérimentale</term><term>.</term></keywords><keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Mondialisation</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">In our earlier work, we have proposed a cyberinfrastructure-based collaboration system for modular product design. One of the main components of the system is a design repository to which suppliers can upload the descriptions of their components using machine-readable, interface-based component description language, so that manufacturers can refer to the descriptions during product design phases. In this paper, we propose an efficient algorithmic approach based on a branch-and-bound (BnB) algorithm to support product design using the interface-based component descriptions stored in the design repository. This product design problem is categorized into a planning problem, whose complexity is known as non-deterministic polynomial-time (NP) hard. For performance evaluation, we compare the performance of the branch-and-bound algorithm with that of a depth-first search (DFS) algorithm, which is an exhaustive search method. This paper describes the details of the proposed branch-and-bound algorithm using a case study and experimental results are discussed.</div></front></TEI><affiliations><list><country><li>Singapour</li><li>États-Unis</li></country><region><li>Illinois</li></region></list><tree><country name="États-Unis"><region name="Illinois"><name sortKey="Yoo, John Jung Woon" sort="Yoo, John Jung Woon" uniqKey="Yoo J" first="John Jung-Woon" last="Yoo">John Jung-Woon Yoo</name></region><name sortKey="Aryasomayajula, Anirudh" sort="Aryasomayajula, Anirudh" uniqKey="Aryasomayajula A" first="Anirudh" last="Aryasomayajula">Anirudh Aryasomayajula</name></country><country name="Singapour"><noRegion><name sortKey="Seung Ki Moon" sort="Seung Ki Moon" uniqKey="Seung Ki Moon" last="Seung Ki Moon">SEUNG KI MOON</name></noRegion></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/CyberinfraV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000449 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 000449 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= CyberinfraV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= Pascal:14-0082576
|texte= An Efficient Branch-and-Bound Algorithm for Interface-Based Modular Product Design and Performance Evaluation
}}
| This area was generated with Dilib version V0.6.25. |  |